Total dominator chromatic number of $P_m\t C_n$

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

total dominator chromatic number of a graph

given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...

متن کامل

Dominator Chromatic Number of Middle and Total Graphs

Dominator chromatic number of middle and total graphs of various graph families is found in this paper. Also these parameters are compared with dominator chromatic number of their respective graph families.

متن کامل

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs

A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...

متن کامل

A Bound on the Total Chromatic Number

We prove that the total chromatic number of any graph with max imum degree is at most plus an absolute constant In particular we show that for su ciently large the total chromatic number of such a graph is at most The proof is probabilistic

متن کامل

Snarks with Total Chromatic Number 5

A k-total-coloring of G is an assignment of k colors to the edges and vertices of G, so that adjacent and incident elements have different colors. The total chromatic number of G, denoted by χT (G), is the least k for which G has a k-total-coloring. It was proved by Rosenfeld that the total chromatic number of a cubic graph is either 4 or 5. Cubic graphs with χT = 4 are said to be Type 1, and c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaya Journal of Matematik

سال: 2020

ISSN: 2319-3786,2321-5666

DOI: 10.26637/mjm0804/0022